/**
*      author: Y_Yao
*      created: 2024-12-14 17:22:25
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 100 + 7;
int a[N];
int n;
int f[N],g[N];

void solve()
{
    cin >> n;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        f[i] = g[i] = 1;
    }

    for(int i = 2;i <= n;i++)
    {
        for(int j = 1;j < i;j++)
        {
            if(a[i] > a[j] && g[i] <= g[j] + 1)
            {
                g[i] = g[j] + 1;
            }
        }
    }

    for(int i = n - 1;i >= 1;i--)
    {
        for(int j = i + 1;j <= n;j++)
        {
            if(a[j] < a[i] && f[i] <= f[j] + 1)
            {
                f[i] = f[j] + 1;
            }
        }
    }

    int ans = 0;
    for(int i = 1;i <= n;i++)
    {
        int x = g[i] + f[i] - 1;
        ans = max(ans,x);
    }

    cout << n - ans << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}